On a decentralized trustless pseudo-random number generation algorithm
نویسنده
چکیده
We construct an algorithm that permits a large group of individuals to reach consensus on a random number, without having to rely on any third parties. The algorithm works with high probability if there are less than 50% of colluding parties in the group. We describe also some modifications and generalizations of the algorithm.
منابع مشابه
Two Improved Pseudo-Random Number Generation Algorithms Based on the Logistic Map
In this study, we improve the pseudo-random number generation algorithm of Java based on the logistic map. We replace the seed of the random generation algorithm with a sequence of numbers which is generated by the original logistic map and the improved logistic map. And then we describe the two improved algorithms in detail including the essence of two algorithms and the processes. Also we dis...
متن کاملFaster Quasi Random Number Generator for Most Monte Carlo Simulations
Generating quasi-random sequences for Monte Carlo simulations has been proved of interest when comparing results with numbers coming from conventional pseudorandom sequences. Despite a fair amount of sound theoretical work on random number generation algorithms, theoretical gain is often eradicated by poor computer implementations. Recently, one of the authors of this paper showed that massive ...
متن کاملHydra: A Trustless Decentralized Digital Identity System
Current solutions for unified digital identities are insecure and have not been successful in reaching wide adoption. These solutions have several pitfalls due to being centralized and requiring the user to trust a third party. We propose a trustless decentralized digital identity system as a novel solution to the problem of maintaining unified digital identities.
متن کاملNew Design of Crypto-Based Pseudo random number generator (CBPRNG) using BLOW FISH cipher
Random Number Generators (RNGs) are an important building block for algorithms and protocols in cryptography. Random number generation is used in a wide variety of cryptographic operations, such as key generation and challenge/response protocols. A random number generator outputs a sequence of 0s and 1s such that at any position, the next bit cannot be expected on the previous bits. However, tr...
متن کاملHigh-Performance Pseudo-Random Number Generation on Graphics Processing Units
This work considers the deployment of pseudo-random number generators (PRNGs) on graphics processing units (GPUs), developing an approach based on the xorgens generator to rapidly produce pseudo-random numbers of high statistical quality. The chosen algorithm has configurable state size and period, making it ideal for tuning to the GPU architecture. We present a comparison of both speed and sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016